Parallel square-root iterations for multiple roots
نویسندگان
چکیده
منابع مشابه
Functions Preserving Matrix Groups and Iterations for the Matrix Square Root
For which functions f does A ∈ G ⇒ f(A) ∈ G when G is the matrix automorphism group associated with a bilinear or sesquilinear form? For example, if A is symplectic when is f(A) symplectic? We show that group structure is preserved precisely when f(A) = f(A) for bilinear forms and when f(A) = f(A) for sesquilinear forms. Meromorphic functions that satisfy each of these conditions are characteri...
متن کاملRobust sketching for multiple square-root LASSO problems
Many learning tasks, such as cross-validation, parameter search, or leave-one-out analysis, involve multiple instances of similar problems, each instance sharing a large part of learning data with the others. We introduce a robust framework for solving multiple square-root LASSO problems, based on a sketch of the learning data that uses low-rank approximations. Our approach allows a dramatic re...
متن کاملParallel-Array Implementations of a Non-Restoring Square Root Algorithm
In this paper, we present a parallel-array implementation of a new non-restoring square root algorithm (PASQRT). The carry-save adder (CSA) is used in the parallel array. The PASQRT has several features unlike other implementations. First, it does not use redundant representation for square root result. Second, each iteration generates an exact resulting value. Next, it does not require any con...
متن کاملSquare Roots Modulo p
The algorithm of Tonelli and Shanks for computing square roots modulo a prime number is the most used, and probably the fastest among the known algorithms when averaged over all prime numbers. However, for some particular prime numbers, there are other algorithms which are considerably faster. In this paper we compare the algorithm of Tonelli and Shanks with an algorithm based in quadratic fiel...
متن کاملRoots, iterations and logarithms of formal automorphisms
In this paper it is proved that having a logarithm is e1uivalent to having roots of arbitrary order in the group of automorphisms of a formal power series ring, and in algebraic subgroups, too. INTRODUCTION The question whether an automorphism of a complex formal power series ring has an iteration, or may be embedded in a one parameter group has received much attention lately. The original sett...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1980
ISSN: 0898-1221
DOI: 10.1016/0898-1221(80)90035-8